A Method to Find Linear Decompositions for Incompletely Specified Index Generation Functions Using Difference Matrix

نویسندگان

  • Tsutomu Sasao
  • Yuta Urano
  • Yukihiro Iguchi
چکیده

This paper shows a method to find a linear transformation that reduces the number of variables to represent a given incompletely specified index generation function. It first generates the difference matrix, and then finds a minimal set of variables using a covering table. Linear transformations are used to modify the covering table to produce a smaller solution. Reduction of the difference matrix is also considered. key words: minimal cover, linear transformation, functional decomposition, incompletely specified function, logic minimization

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Linear Decomposition of Index Generation Functions: Optimization Using Autocorrelation Functions

Various methods exist to decompose logic functions into linear and nonlinear parts. They are used to simplify AND-OR logic circuits [3, 5, 7, 9, 22], or to simplify binary decision diagrams [4, 6, 8]. The first important observation is that the linear part can be implemented with lower cost than the non-linear part [7, 9]. To find a linear part of a decomposition, Walsh spectrum [3] and autocor...

متن کامل

A Balanced Decision Tree Based Heuristic for Linear Decomposition of Index Generation Functions

Index generation functions model content-addressable memory, and are useful in virus detectors and routers. Linear decompositions yield simpler circuits that realize index generation functions. This paper proposes a balanced decision tree based heuristic to efficiently design linear decompositions for index generation functions. The proposed heuristic finds a good linear decomposition of an ind...

متن کامل

Multiple-Valued Index Generation Functions: Reduction of Variables by Linear Transformation

We consider incompletely specified multiple-valued input index generation functions f : D → {1, 2, . . . , k}, where D ⊆ Pn and P = {0, 1, 2, . . . , p − 1}. In such functions, the number of variables to represent f can be often reduced. Let k be the number of elements in D. We show that most functions can be represented with 2 logp(k + 1) or fewer variables, when k is sufficiently smaller than...

متن کامل

Index Generation Functions: Tutorial

Given a set of k distinct binary vectors of n bits, for each vector assign a unique integer from 1 to k. An incompletely specified index generation function produces an index for a given vector. This tutorial first introduces index generation functions, which are useful for pattern matching in communication circuits. Then, it shows a method to represent a given index generation function using f...

متن کامل

Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation

Introduction Fractional differential equations (FDEs)  have  attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme  may be a good approach, particularly, the schemes in numerical linear algebra for solving ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 97-A  شماره 

صفحات  -

تاریخ انتشار 2014